Probabilistic Quantifier Logic for General Intelligence: An Indefinite Probabilities Approach
نویسندگان
چکیده
Indefinite probabilities are a novel technique for quantifying uncertainty, which were created as part of the PLN (Probabilistic Logic Networks) logical inference engine, which is a key component of the Novamente Cognition Engine (NCE), an integrative AGI system. Previous papers have discussed the use of indefinite probabilities in the context of a variety of logical inference rules, but have omitted discussion of quantification. Here this gap is filled, and a mathematical procedure is provided allowing the propagation of indefinite probabilities through universal and existential quantifiers, and also through a variety of fuzzy quantifiers corresponding to natural language quantifiers (such as “few”, “man”, “a lot”, “hardly any”, etc.). Proper probabilistic handling of various quantifier transformation rules is also discussed. Together with the ideas in prior publications, and a forthcoming sequel paper on indefinite probabilities for intensional inference, these results allow probabilistic logic based on indefinite probabilities to be utilized for the full scope of inferences involved in intelligent reasoning. To illustrate the ideas and algorithms involved, we give two concrete examples: Halpern’s “crooked lottery” predicate, and a commonsense syllogism that uses fuzzy quantifiers together with the standard PLN term logic deduction rule.
منابع مشابه
A Semantics for Probabilistic Quantifier-Free First-Order Languages, with Particular Application to Story Understanding
We present a semantics for interpreting probabilistic statements expressed in a first-order quantifier-free language. We show how this semantics places constraints on the probabilities which can be associated with such statements. We then consider its use in the area of story understanding. We show that for at least simple models of stories (equivalent to the script/plan models) there arc ways ...
متن کاملOn the Logic of Nonmonotonic Conditionals and Conditional Probabilities: Predicate Logic
In a previous paper I described a range of nonmonotonic conditionals that behave like conditional probability functions at various levels of probabilistic support. These conditionals were defined as semantic relations on an object language for sentential logic. In this paper I extend the most prominent family of these conditionals to a language for predicate logic. My approach to quantifiers is...
متن کاملQuantifier Strengths Predict Scopal Possibilities of Mandarin Chinese Wh-indefinites
It is widely noted that quantifier scope in English is bounded by relative clauses, if -clauses, and perhaps tensed clauses in general. It is also well known that indefinite determiners such as a, some, and a certain are exempt from this restriction. We can try to explain this discrepancy in two ways. On one hand, maybe indefinite NPs take scope through a mechanism separate from (and more liber...
متن کاملA Logic For Inductive Probabilistic Reasoning
Inductive probabilistic reasoning is understood as the application of inference patterns that use statistical background information to assign (subjective) probabilities to single events. The simplest such inference pattern is direct inference: from “70% of As are Bs” and “a is an A” infer that a is a B with probability 0.7. Direct inference is generalized by Jeffrey’s rule and the principle of...
متن کاملLiftability of Probabilistic Inference: Upper and Lower Bounds
We introduce a general framework for defining classes of probabilistic-logic models and associated classes of inference problems. Within this framework we investigate the complexity of inference in terms of the size of logical variable domains, query and evidence, corresponding to different notions of liftability. Surveying existing and introducing new results, we present an initial complexity ...
متن کامل